Assessing Error Bound For Dominant Point Detection
نویسنده
چکیده
This paper compares the error bounds of two classes of dominant point detection methods, viz. methods based on reducing a distance metric and methods based on digital straight segments. We highlight using two methods in each class that the error bounds within the same class may vary depending upon the fine details and control parameters of the methods but the essential error bound can be determined analytically for each class. The assessment presented in this paper will enable the users of dominant point detection methods to understand the nature of error in the method of their choice and help them to make better decision about the methods and their control parameters.
منابع مشابه
A Comprehensive Performance Analysis of Direct Detection Receivers inWDMASystems
In this work the performance of a wavelength division multiple access (WDMA) system with direct detection receiver is investigated. For this purpose, the probability of error in a WDMA network with OOK modulation considering crosstalk, ISI, photo detector noise and thermal noise is calculated and the effect of each on system performance is investigated. The system performance in presence of PIN...
متن کاملA novel framework for making dominant point detection methods non-parametric
Most dominant point detection methods require heuristically chosen control parameters. One of the commonly used control parameter is maximum deviation. This paper uses a theoretical bound of the maximum deviation of pixels obtained by digitization of a line segment for constructing a general framework to make most dominant point detection methods nonparametric. The derived analytical bound of t...
متن کاملNetwork Error Correction, Part I: Basic Concepts and Upper Bounds
Error correction in existing point-to-point communication networks is done on a link-by-link basis, which is referred to in this paper as classical error correction. Inspired by network coding, we introduce in this two-part paper a new paradigm called network error correction. The theory thus developed subsumes classical algebraic coding theory as a special case. In Part I, we discuss the basic...
متن کاملStability of the Levinson Algorithm for Toeplitz-Like Systems
Numerical stability of the Levinson algorithm, generalized for Toeplitz-like systems, is studied. Arguments based on the analytic results of an error analysis for floating point arithmetic produce an upper bound on the norm of the residual vector, which grows exponentially with respect to the size of the problem. The base of such an exponential function can be small for diagonally dominant Toep...
متن کاملAssessing barriers to medical errors reporting the view point of nurses in selected hospitals of Ahvaz
Background and Objective: Learning from errors through error reporting leads to changes in hospital processes and improved health outcomes. Therefore, this study examines assessing barriers to medical errors reporting the view point of nurses in selected hospitals of Ahvaz. Materials and Methods: The current study is descriptive analysis research. The statistical population included all the nu...
متن کامل